Computer and Modernization ›› 2011, Vol. 1 ›› Issue (6): 83-5.doi: 10.3969/j.issn.1006-2475.2011.06.024

• 算法分析与设计 • Previous Articles     Next Articles

Greedy Particle Swarm Algorithms for Multidimensional Knapsack Problems

HAO Jun-ling   

  1. School of Information Technology & Management Engineering, University of International Business and Economics, Beijing 100029, China
  • Received:2011-03-28 Revised:1900-01-01 Online:2011-06-29 Published:2011-06-29

Abstract: Two new greedy transformations and the inspired algorithms are proposed to solve multidimensional knapsack problems (MKP01) with weight and volume constraints. Convex combination and infinite norm of the ratio vectors of performance to weight and performance to volume are computed and two integrative "performanceprice ratio" vectors are obtained. Two greedy PSOs variants (wPSO: weighted PSO, infPSO: infinite norm PSO) are presented for MKP01 based on the integrative "performanceprice ratio". The standard PSO, hybrid wPSO and infPSO are applied to solve various scales of MKP instances. Numerical experiments illustrate that wPSO and infPSO not only outperform PSO greatly, but also show excellent and steady searching abilities and encouraging efficiency to locate the optimal solutions.

Key words: multidimensional knapsack problem, particle swarm optimization, greedy transformation, integrative performanceprice ratio